Stochastic evolutionary dynamics in minimum-effort coordination games
نویسندگان
چکیده
منابع مشابه
Minimum-Effort Coordination Games: Stochastic Potential and Logit Equilibrium
This paper revisits the minimum-effort coordination game with a continuum of Paretoranked Nash equilibria. Noise is introduced via a logit probabilistic choice function. The resulting logit equilibrium distribution of decisions is unique and maximizes a stochastic potential function. In the limit as the noise vanishes, the distribution converges to an outcome that is analogous to the risk-domin...
متن کاملPositive feedback in coordination games: stochastic evolutionary dynamics and the logit choice rule
We show that under the logit dynamics, positive feedback among agents (also called bandwagon property) induces evolutionary paths along which agents repeat the same actions consecutively so as to minimize the payoff loss incurred by the feedback effects. In particular, for paths escaping the domain of attraction of a given equilibrium—called a convention—positive feedback implies that along the...
متن کاملEvolutionary Stochastic Games
We extend the notion of Evolutionarily Stable Strategies introduced by Maynard Smith & Price [6] in 1973 for models ruled by a single fitness matrix A, to the framework of stochastic games developed by Lloyd Shapley [13] in 1953 where, at discrete stages in time, players play one of finitely many matrix games, while the transitions from one matrix game to the next follow a jointly controlled Ma...
متن کاملSpatial effect on stochastic dynamics of bistable evolutionary games
We consider the lifetimes of metastable states in bistable evolutionary games (coordination games), and examine how they are affected by spatial structure. A semiclassical approximation based on a path integral method is applied to stochastic evolutionary game dynamics with and without spatial structure, and the lifetimes of the metastable states are evaluated. It is shown that the population d...
متن کاملCompetition and Coordination in Stochastic Games
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve such type of problems. Among them, there is an important class of algorithms, called adaptive learning algorithms, that were shown to be able to converge in self-play to a solution in a wide variety of the repeated ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2016
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2016.06.007